Line graph

Results: 902



#Item
21Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang†  Abstract

Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract

Add to Reading List

Source URL: web.stanford.edu

Language: English - Date: 2014-12-26 02:45:42
22This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOITPAMI, IEEE T

This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOITPAMI, IEEE T

Add to Reading List

Source URL: www2.ece.ohio-state.edu

Language: English - Date: 2016-03-04 15:36:09
23On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin†  Victor Zamaraev‡

On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-01-06 11:50:35
24Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

Add to Reading List

Source URL: www.cs.uwm.edu

Language: English - Date: 2011-07-31 13:36:56
25PHYSICAL REVIEW E 90, Efficiently inferring community structure in bipartite networks Daniel B. Larremore,1,2 Aaron Clauset,3,4,5 and Abigail Z. Jacobs3 1

PHYSICAL REVIEW E 90, Efficiently inferring community structure in bipartite networks Daniel B. Larremore,1,2 Aaron Clauset,3,4,5 and Abigail Z. Jacobs3 1

Add to Reading List

Source URL: danlarremore.com

Language: English - Date: 2014-07-10 17:42:30
26Lecture 26  Spectral Graph Theory Planar Graphs 2, the Colin de Verdi`ere Number December 4, 2009

Lecture 26 Spectral Graph Theory Planar Graphs 2, the Colin de Verdi`ere Number December 4, 2009

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2012-08-24 09:50:05
27Efficient Comparison of Massive Graphs Through The Use Of ‘Graph Fingerprints’ Stephen Bonner John Brennan

Efficient Comparison of Massive Graphs Through The Use Of ‘Graph Fingerprints’ Stephen Bonner John Brennan

Add to Reading List

Source URL: www.mlgworkshop.org

Language: English - Date: 2016-08-14 01:22:56
28Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell  Computer Engineering and Networks Laboratory

Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:28
29TESTING LARGE-SCALE DIGITAL LINE GRAPHS AND DIGITAL ELEVATION MODELS IN A GEOGRAPHIC INFORMATION SYSTEM by David R. Wolf U.S. Geological Survey 521 National Center

TESTING LARGE-SCALE DIGITAL LINE GRAPHS AND DIGITAL ELEVATION MODELS IN A GEOGRAPHIC INFORMATION SYSTEM by David R. Wolf U.S. Geological Survey 521 National Center

Add to Reading List

Source URL: mapcontext.com

Language: English - Date: 2008-08-30 00:55:51
30A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a

A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a

Add to Reading List

Source URL: www.math.ucsd.edu

Language: English - Date: 2000-06-04 20:41:54